#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=110;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn][maxn],b[10];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;cin>>b[1]>>b[2]>>b[3]>>b[4];
    if(b[1]==b[2]&&b[2]==b[3]&b[3]==b[4]){
        cout<<"YES"<<"\n";
        continue;
    }
    for(LL i=1;i<=4;i++){
        if(i==1){
            if(b[2]>b[4]){
                for(LL j=n;j>=n-b[1]+1;j--) a[1][j]=1;
                b[2]--;
            }
            else{
                for(LL j=1;j<=b[1];j++) a[1][j]=1;
                b[4]--;
            }
        }
        if(i==3){
            if(b[2]>b[4]){
                for(LL j=n;j>=n-b[1]+1;j--) a[n][j]=1;
                b[2]--;
            }
            else{
                for(LL j=1;j<=b[1];j++) a[n][j]=1;
                b[4]--;
            }
        }
    }
    bool flag=1;
    if((a[1][n]==1)+(a[n][n]==1)>b[2]){
        flag=0;
    }
    if( (a[1][1]==1)+(a[n][1]==1)>b[4]){
        flag=0;
    }
    if(0==flag){
        cout<<"NO"<<"\n";
    }
    else cout<<"YES"<<"\n";
  }
return 0;
}
